class Solution {
    public int search(int[] nums, int target) {
        if(nums == null || nums.length == 0) {
            return -1;
        }

        if(nums.length == 1) {
            return nums[0] == target ? 0 : -1;
        }

        if(nums[0] < nums[nums.length - 1]) {
            return binarySearch(nums, target, 0, nums.length - 1);
        }

        int pivotIdx = findPivotIdx(nums);
        //System.out.println("Pivot idx: " + pivotIdx);

        if(target >= nums[0]) {
            return binarySearch(nums, target, 0, pivotIdx - 1);
        } else {
            return binarySearch(nums, target, pivotIdx, nums.length - 1);
        }
        
    }

    private int findPivotIdx(int[] nums) {
        int left = 0, right = nums.length - 1;

        while(left <= right) {
            int mid = left + (right - left) / 2;

            if(nums[mid] > nums[mid + 1]) {
                return mid + 1;
            } else if(nums[mid] < nums[left]) {
                right = mid - 1;
            } else {
                left = mid + 1;
            }
        }

        return -1;
    }


    private int binarySearch(int[] nums, int target, int start , int end) {
        int left = start, right = end;

        while(left <= right) {
            int mid = left + (right - left) / 2;

            if(nums[mid] == target) {
                return mid;
            } else if(nums[mid] < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }

        return -1;
    }
}